Relative Cost Random Access Machines
نویسنده
چکیده
منابع مشابه
Analysis of Pram Instruction Setsfrom a Log Cost
The log cost measure has been viewed as a more reasonable method of measuring the time complexity of an algorithm than the unit cost measure. The more widely used unit cost measure becomes unrealistic if the algorithm handles extremely large integers. Parallel machines have not been examined under the log cost measure. In this paper, we investigate the Parallel Random Access Machine under the l...
متن کاملThe cost of address translation
Modern computers are not random access machines (RAMs). They have a memory hierarchy, multiple cores, and virtual memory. In this paper, we address the computational cost of address translation in virtual memory. Starting point for our work is the observation that the analysis of some simple algorithms (random scan of an array, binary search, heapsort) in either the RAM model or the EM model (e...
متن کاملModelling and solving the job shop scheduling Problem followed by an assembly stage considering maintenance operations and access restrictions to machines
This paper considers job shop scheduling problem followed by an assembly stage and Lot Streaming (LS). It is supposed here that a number of products have been ordered to be produced. Each product is assembled with a set of several parts. The production system includes two stages. The first stage is a job shop to produce parts. Each machine can process only one part at the same time. The second ...
متن کاملDeterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time
Turing machines which use a single tape both for their input and as their only working space (known as 1TTMs) appear to be extremely slow for many problems compared with multi-tape Turing machines and Random Access Machines (RAMS). However, apart from a few simple problems which require quadratic time on a 1TTM but have simple linear time solutions on a multi-tape Turing machine, there have bee...
متن کاملMultiplication, Division and Shift Instructions in Parallel Random Access Machines
Trahan, J.L., M.C. Loui and V. Ramachandran, Multiplication, division and shift instructions in parallel random access machines, Theoretical Computer Science 100 (1992) l-44. We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or on a PRAM with unit-cost shifts is equivalent to polynomial space on a Turing machine (PSPACE). This ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 38 شماره
صفحات -
تاریخ انتشار 1999